Перевод: со всех языков на все языки

со всех языков на все языки

minimax value

См. также в других словарях:

  • Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… …   Wikipedia

  • Minimax estimator — In statistical decision theory, where we are faced with the problem of estimating a deterministic parameter (vector) from observations an estimator (estimation rule) is called minimax if its maximal risk is minimal among all estimators of . In a… …   Wikipedia

  • Example of a game without a value — This article gives an example of a game on the unit square that has no value. It is due to Sion and Wolfe [cite journal | author=M. Sion, P. Wolfe | title=On a game with no value | journal= The Annals of Mathematical Studies| year=1957 |… …   Wikipedia

  • game theory — a mathematical theory that deals with strategies for maximizing gains and minimizing losses within prescribed constraints, as the rules of a card game: widely applied in the solution of various decision making problems, as those of military… …   Universalium

  • MTD-f — MTD(f), an abbreviation of MTD(n,f) (Memory enhanced Test Driver with node n and value f) is a minimax search algorithm better than the basic alpha beta pruning algorithm. Zero Window Searches MTD(f) efficiently does only zero window alpha beta… …   Wikipedia

  • Alpha-beta pruning — is a search algorithm which seeks to reduce the number of nodes that are evaluated in the search tree by the minimax algorithm. It is a search with adversary algorithm used commonly for machine playing of two player games (Tic tac toe, Chess, Go …   Wikipedia

  • Negascout — or Principal Variation Search is a negamax algorithm that can be faster than alpha beta pruning. Like alpha beta pruning, NegaScout is a directional search algorithm for computing the minimax value of a node in a tree. It dominates alpha beta… …   Wikipedia

  • SSS* — is a search algorithm, introduced by Stockman in 1979, that conducts a state space search traversing a game tree in a best first fashion similar to that of the A* search algorithm.SSS* is based on the notion of solution trees. Informally, a… …   Wikipedia

  • Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia

  • Negamax — search is a slightly variant formulation of minimax search that relies on the zero sum property of a two player game. An animated pedagogical example showing the plain negamax algorithm (that is, without alpha beta pruning). The person performing …   Wikipedia

  • Expectiminimax tree — An expectiminimax tree is a specialized variation of a minimax tree for use in artificial intelligence systems which play games of chance. In addition to min and max nodes of the traditional minimax tree, this variant has chance nodes, which take …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»